Fast Quantum Algorithm for Numerical Gradient Estimation
نویسندگان
چکیده
منابع مشابه
Fast quantum algorithm for numerical gradient estimation.
Given a black box for f, a smooth real scalar function of d real variables, one wants to estimate [symbol: see text]f at a given point with n bits of precision. On a classical computer this requires a minimum of d + 1 black box queries, whereas on a quantum computer it requires only one query regardless of d. The number of bits of precision to which f must be evaluated matches the classical req...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولQuantum computational gradient estimation
The vector gradient of a real-valued function f of a vector argument can be calculated using just two calls to a black-box quantum oracle for f . The mechanism is simple, and capitalises on the fact that, in the vicinity of a point x, e2πiλf(x) is periodic, with period parallel and inversely proportional to ∇f(x). A superposed state is created discretising a small hyperrectangle around the doma...
متن کاملHarmonics Estimation in Power Systems using a Fast Hybrid Algorithm
In this paper a novel hybrid algorithm for harmonics estimation in power systems is proposed. The estimation of the harmonic components is a nonlinear problem due to the nonlinearity of phase of sinusoids in distorted waveforms. Most researchers implemented nonlinear methods to extract the harmonic parameters. However, nonlinear methods for amplitude estimation increase time of convergence. Hen...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2005
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.95.050501